MAYBE 4.79
↳ HASKELL
↳ BR
((enumFromThen :: Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> [Ordering]) |
import qualified Prelude |
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((enumFromThen :: Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> [Ordering]) |
import qualified Prelude |
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
p
| n' >= n
= flip (<=) m | otherwise
= flip (>=) m
p = p2
p1 True = flip (<=) m p1 False = p0 otherwise
p0 True = flip (>=) m
p2 = p1 (n' >= n)
takeWhile p [] = [] takeWhile p (x : xs)
| p x
= x : takeWhile p xs | otherwise
= []
takeWhile p [] = takeWhile3 p [] takeWhile p (x : xs) = takeWhile2 p (x : xs)
takeWhile1 p x xs True = x : takeWhile p xs takeWhile1 p x xs False = takeWhile0 p x xs otherwise
takeWhile0 p x xs True = []
takeWhile2 p (x : xs) = takeWhile1 p x xs (p x)
takeWhile3 p [] = [] takeWhile3 wv ww = takeWhile2 wv ww
toEnum 0 = LT toEnum 1 = EQ toEnum 2 = GT
toEnum xw = toEnum5 xw toEnum wy = toEnum3 wy toEnum wx = toEnum1 wx
toEnum0 True wx = GT
toEnum1 wx = toEnum0 (wx == 2) wx
toEnum2 True wy = EQ toEnum2 wz xu = toEnum1 xu
toEnum3 wy = toEnum2 (wy == 1) wy toEnum3 xv = toEnum1 xv
toEnum4 True xw = LT toEnum4 xx xy = toEnum3 xy
toEnum5 xw = toEnum4 (xw == 0) xw toEnum5 xz = toEnum3 xz
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
((enumFromThen :: Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> [Ordering]) |
import qualified Prelude |
takeWhile p (numericEnumFromThen n n') where
p = p2
p0 True = flip (>=) m
p1 True = flip (<=) m p1 False = p0 otherwise
p2 = p1 (n' >= n)
numericEnumFromThenToP2 yu yv yw = numericEnumFromThenToP1 yu yv yw (yu >= yv)
numericEnumFromThenToP1 yu yv yw True = flip (<=) yw numericEnumFromThenToP1 yu yv yw False = numericEnumFromThenToP0 yu yv yw otherwise
numericEnumFromThenToP yu yv yw = numericEnumFromThenToP2 yu yv yw
numericEnumFromThenToP0 yu yv yw True = flip (>=) yw
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
((enumFromThen :: Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> [Ordering]) |
import qualified Prelude |
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ Narrow
(enumFromThen :: Ordering -> Ordering -> [Ordering]) |
import qualified Prelude |
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ NonTerminationProof
↳ QDP
↳ QDP
↳ Narrow
new_map(yx6, ba) → new_map(yx6, ba)
new_map(yx6, ba) → new_map(yx6, ba)
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ NonTerminationProof
↳ QDP
↳ Narrow
new_map0 → new_map0
new_map0 → new_map0
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ NonTerminationProof
↳ Narrow
new_map1 → new_map1
new_map1 → new_map1
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ Narrow
↳ AND
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ QDP
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ NonTerminationProof
↳ QDP
new_map0([]) → new_map0([])
new_map0([]) → new_map0([])
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
new_map1([]) → new_map1([])